Think again – supplying war: reappraising military logistics and its centrality to strategy and war

This article argues that logistics constrains strategic opportunity while itself being heavily circumscribed by strategic and operational planning. With the academic literature all but ignoring the centrality of logistics to strategy and war, this article argues for a reappraisal of the critical role of military logistics, and posits that the study and conduct of war and strategy are incomplete at best or false at worst when they ignore this crucial component of the art of war. The article conceptualises the logistics–strategy nexus in a novel way, explores its contemporary manifestation in an age of uncertainty, and applies it to a detailed case study of UK operations in Iraq and Afghanistan since 2001.     

基于D矩阵的舰船电子装备综合诊断方法

针对舰船电子装备综合诊断实现要求,提出一种基于故障-测试依赖性关系(D)矩阵的综合诊断方法,利用同一D矩阵分别完成对舰船电子装备的测试性分析评估、测试诊断需求分配、诊断测试序列生成和诊断信息的共享,实现舰船电子装备综合诊断各过程诊断信息模型的一致.该方法已在某舰载电子装备综合诊断实现中得到验证和应用.     

实时仿真计算机系统的若干问题

本文比较了实时仿真计算机系统中配备A/D、D/A变换器的两种方案。分析了几种检索算法,并且提出了一种新的全并行检索方法——映象检索。文中论述了仿真计算任务的特点及其并行性的开发。本文在分析了AD-10的缺点之后指出,纯异构型仿真专用多处理机的局限性较大,不能充分开发仿真计算任务的并行性。较好的结构形式应是以同构型多处理机为核心。     

MAD,not Marx: Khrushchev and the nuclear revolution

The revival of nuclear strategy in US policy and scholarship has been strengthened by arguments that the ‘nuclear revolution’ – the assumption that thermonuclear bombs and missiles had made major war too dangerous to wage – does not affect international behaviour as much as nuclear revolution advocates claim. This article shows that the Soviet leader Nikita Khrushchev indeed regarded nuclear war as too dangerous to wage, a decision which manifested itself not so much in foreign policy or military doctrine but in his determination to avoid war when the possibility arose. We argue that Khrushchev’s experience provides us with a more useful way to characterise the nuclear revolution and suggest some implications of this argument for contemporary debates about nuclear weaponry.     

Exponential size neighborhoods for makespan minimization scheduling

We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be searched in polynomial time, and we derive worst‐case approximation guarantees for the local optima of such neighborhoods. The so‐called split neighborhood splits a feasible schedule into two layers, and then recombines the two layers by finding a perfect matching. We show that the makespan of every local optimum for split is at most a factor of 2 away from the globally optimal makespan. We then combine the split neighborhood with two neighborhoods from the literature. The combination of split with the jump neighborhood only marginally improves the approximation guarantee, whereas the combination with the lexicographic‐jump neighborhood decreases the approximation guarantee from 2 to 3/2. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

On the optimal detection of an underwater intruder in a channel using unmanned underwater vehicles

Given a number of patrollers that are required to detect an intruder in a channel, the channel patrol problem consists of determining the periodic trajectories that the patrollers must trace out so as to maximized the probability of detection of the intruder. We formulate this problem as an optimal control problem. We assume that the patrollers' sensors are imperfect and that their motions are subject to turn‐rate constraints, and that the intruder travels straight down a channel with constant speed. Using discretization of time and space, we approximate the optimal control problem with a large‐scale nonlinear programming problem which we solve to obtain an approximately stationary solution and a corresponding optimized trajectory for each patroller. In numerical tests for one, two, and three underwater patrollers, an underwater intruder, different trajectory constraints, several intruder speeds and other specific parameter choices, we obtain new insight—not easily obtained using simply geometric calculations—into efficient patrol trajectory design under certain conditions for multiple patrollers in a narrow channel where interaction between the patrollers is unavoidable due to their limited turn rate.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

无刷双馈电机原理及控制策略

详细分析了无刷双馈发电机的基本原理,基于不同的参考坐标系(转子轴dq0坐标系和同步坐标系),建立了无刷双馈发电机不同的数学模型.依据建立的数学模型,介绍了无刷双馈发电机的几种控制策略(标量控制、磁场定向控制、直接转矩控制、智能控制方法),并指出其优缺点.最后,指出了无刷双馈发电机运行控制中存在的难点和进一步研究的方向.     

潜艇线式巡逻的最佳对策研究

本文先用面积法求出线式巡逻潜艇发现目标的概率,然后对潜艇发现目标距离作了分析。在此基础上,建立了潜艇线式巡逻的矩阵对策模型,并用计算机对此模型进行求解,得到了潜艇线式巡逻的最佳对策。最后,对最佳对策作了讨论。本文建立的矩阵对策模型和求得的结果以及求解方法可为组织潜艇进行线式巡逻提供决策的科学依据。     

决策树知识表示的多故障源搜索算法研究

在深入研究产生式规则知识表示的基础上,运用决策树知识表示方法,完成故障诊断专家系统的知识库设计,对传统的单故障源决策树搜索算法进行了改进,解决了相同故障现象的多故障源连续搜索和定位问题,提高了推理机单次故障诊断的定位率和搜索效率,缩短了故障诊断专家系统的诊断时间。     

自适应两步滤波算法在机载IRSTS被动定位中的应用

在机载红外搜索跟踪系统被动定位研究中,针对扩展卡尔曼滤波算法要求先验的噪声统计及存在系统观测模型线性化误差影响滤波精度的特点,利用两步滤波算法并结合Sage-Husa噪声估计器构建了适用于机载IRSTS被动定位特点的自适应两步滤波算法模型,算法不仅实时在线地估计了观测噪声的统计特性,而且避免了观测模型线性化误差.仿真结果表明,在完全相同的初始条件下,自适应两步滤波算法对目标运动参数的估计结果明显优于扩展卡尔曼滤波,从而提高了机载IRSTS被动定位的精度.